Algebra Oral Qualifying Exam Syllabus

ثبت نشده
چکیده

algebra is the study of fundamental algebraic structures that occur throughout mathematics: groups, rings, modules, categories, and fields—as well as maps between them. A solid grasp of algebra can be useful to students of all mathematical stripes, and accordingly the suggested syllabus is a “strong core plus more” model: a student preparing for an oral qualifying exam in algebra should (1) feel confident with the core topics (covered in most offerings of 101/111) and (2) should select a supplementary advanced topic for examination, in consultation with the chosen oral exam committee. The core and some suggested supplementary topics are listed below. 1. Core topics covered in most offerings of 101/111 (1) Groups (e.g., [4, Chapters 1–5], [15, Chapters 1-6]) (a) Cyclic, abelian, non-abelian groups; normal subgroups and quotient groups; normal series, solvable groups, commutators, composition series, Jordan-Hölder theorem; the extension problem (b) Group actions, G-sets and structure theorem, Sylow theory, semi-direct products and split exact sequences (c) Symmetric group, alternating subgroup, cycle decomposition and conjugacy classes (2) Rings (e.g., [4, Chapter 7–9], [10, Chapters 2,4], [15, Chapters 7-8]) (a) Rings: examples, properties, homomorphisms, group rings, polynomial rings, division algorithm, polynomials versus polynomial maps (b) Ideals: prime and maximal ideals, operations on ideals, Chinese remainder theorem (CRT) (c) Irreducibles and prime elements, UFDs, PIDs, Noetherian rings, Euclidean domains, Gauss’s lemma and corollaries, irreducibility tests, Hilbert’s Basis Theorem, cyclotomic polynomials (3) Modules and categories (e.g., [3, Chapters 2–3], [4, Chapters 10–12, Appendix II], [10, Chapter 3]) (a) Vector spaces and linear algebra (b) Modules: simple, indecomposable, free, isomorphism theorems (c) Basic category theory: universal definitions, functors (d) Exact sequences, sections, retractions; and connections to free and projective modules (e) Products and coproducts of modules: Hom(·, ·) as a functor and exactness properties, and Hom( ⊕ i Mi, ∏ j Nj) (f) Localization, tensor products, extension of scalars, flat modules; and connections with coproducts, pullbacks, pushouts (g) Finitely generated modules over a PID: general structure theory, linear operators and vector spaces as k[x]-modules, applications to canonical forms Date: July 10, 2017.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Qualifying Exam Syllabus Proposal

Exam Committee Exam Logistics Committee Chairperson: Date: Prof. Monica Vazirani Thursday September 3, 2015 Committee Members: Time: Prof. Dan Romik 11AM-2PM Assoc. Fu Liu Location: Prof. Greg Kuperberg MSB 3106 Prof. Francisco J. Samaniego 1 Proposed Research Talk 1.1 The Catalan numbers and q-analogues. A lattice path is a sequence of North N(0, 1) and East E(1, 0) steps in the first quadrant...

متن کامل

CAAM 454/554: Afternotes on Krylov-Subspace Iterative Methods

These notes are written as supplements to the textbook, “Numerical Linear Algebra” by Lloyd Trefethen and David Bau, for CAAM 454/554 students. Those who are preparing for the CAAM Ph.D Qualifying exam on Numerical Analysis should do the exercises provided in these notes. We will mostly follow the notation of the book. For instance, unless otherwise specified, the norm ‖ · ‖ refers to the Eucli...

متن کامل

Qualifying Exam Syllabus

Basic constructions: The completeness and compactness theorems. The Löwenheim-Skolem theorem. Omitting types. Ultraproducts. Indiscernible sequences. Nice properties: Saturation, homogeneity, and the monster model. Elimination of imaginaries and Meq. Quantifier elimination. Model completeness. Countably categorical theories. Stable theories: Characterizations of a stable formula. Stable, supers...

متن کامل

Mini Project Programming Exams

A number of different types of final programming exams used or considered at the Department of Computer Science, Aalborg University, are identified and analyzed. Based on this analysis, a new type of programming exam is introduced called a Mini Project Programming (MIP) exam. MIP is a group-based programming assignment that is intended as a medium-scale programming effort followed by a final or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017